Proof assistants

Results: 54



#Item
31The Why3 platform Version 0.82, December 2013 François Bobot1,2 Jean-Christophe Filliâtre1,2

The Why3 platform Version 0.82, December 2013 François Bobot1,2 Jean-Christophe Filliâtre1,2

Add to Reading List

Source URL: why3.lri.fr

Language: English - Date: 2013-12-12 05:50:31
32Under consideration for publication in Math. Struct. in Comp. Science Formalization of Real Analysis: A Survey of Proof Assistants and Libraries∗ SYLVIE BOLDO CATHERINE LELAY

Under consideration for publication in Math. Struct. in Comp. Science Formalization of Real Analysis: A Survey of Proof Assistants and Libraries∗ SYLVIE BOLDO CATHERINE LELAY

Add to Reading List

Source URL: www.lri.fr

Language: English - Date: 2014-12-04 07:10:42
33The Why3 platform Version, May 2016 François Bobot1,2 Jean-Christophe Filliâtre1,2

The Why3 platform Version, May 2016 François Bobot1,2 Jean-Christophe Filliâtre1,2

Add to Reading List

Source URL: why3.lri.fr

Language: English - Date: 2016-05-27 08:19:42
34Recent Developments in ΩMEGA’s Proof Search Programming Language Serge Autexier Dominik Dietrich

Recent Developments in ΩMEGA’s Proof Search Programming Language Serge Autexier Dominik Dietrich

Add to Reading List

Source URL: dream.inf.ed.ac.uk

Language: English - Date: 2010-07-03 11:10:40
35CTP-based programming languages ? Considerations about an experimental design Florian Haftmann Cezary Kaliszyk

CTP-based programming languages ? Considerations about an experimental design Florian Haftmann Cezary Kaliszyk

Add to Reading List

Source URL: dream.inf.ed.ac.uk

Language: English - Date: 2010-07-03 11:12:42
36Types in functional languages Dependent types and the Propositions-as-Types Isomorphism The Coq system and inductive types Rich types for programming and proving Radboud University Nijmegen

Types in functional languages Dependent types and the Propositions-as-Types Isomorphism The Coq system and inductive types Rich types for programming and proving Radboud University Nijmegen

Add to Reading List

Source URL: www.cs.ru.nl

Language: English - Date: 2015-01-06 13:25:00
37De Bruijn’s ideas on the Formalization of Mathematics Herman Geuvers Radboud Universiteit Nijmegen & Technische Universiteit Eindhoven Foundation of Mathematics for Computer-Aided Formalization Padova, 9-11 January 201

De Bruijn’s ideas on the Formalization of Mathematics Herman Geuvers Radboud Universiteit Nijmegen & Technische Universiteit Eindhoven Foundation of Mathematics for Computer-Aided Formalization Padova, 9-11 January 201

Add to Reading List

Source URL: www.cs.ru.nl

Language: English - Date: 2013-01-17 04:22:03
38Can the computer really help us to prove theorems?

Can the computer really help us to prove theorems?

Add to Reading List

Source URL: www.cs.ru.nl

Language: English - Date: 2011-11-17 12:13:56
39Expressiveness + Automation + Soundness: Towards Combining SMT Solvers and Interactive Proof Assistants Pascal Fontaine, Jean-Yves Marion, Stephan Merz, Leonor Prensa Nieto, and Alwen Tiu LORIA – INRIA Lorraine – Uni

Expressiveness + Automation + Soundness: Towards Combining SMT Solvers and Interactive Proof Assistants Pascal Fontaine, Jean-Yves Marion, Stephan Merz, Leonor Prensa Nieto, and Alwen Tiu LORIA – INRIA Lorraine – Uni

Add to Reading List

Source URL: www.montefiore.ulg.ac.be

Language: English - Date: 2006-01-07 06:25:43
    40Verification of a Cryptographic Primitive: SHA-256 ANDREW W. APPEL, Princeton University A full formal machine-checked verification of a C program: the OpenSSL implementation of SHA-256. This is an interactive proof of f

    Verification of a Cryptographic Primitive: SHA-256 ANDREW W. APPEL, Princeton University A full formal machine-checked verification of a C program: the OpenSSL implementation of SHA-256. This is an interactive proof of f

    Add to Reading List

    Source URL: www.cs.princeton.edu

    Language: English - Date: 2014-12-23 10:16:22